Exactly unitary discrete representations of the metaplectic transform for linear-time algorithms

Optimal Finite-time Control of Positive Linear Discrete-time Systems

This paper considers solving optimization problem for linear discrete time systems such that closed-loop discrete-time system is positive (i.e., all of its state variables have non-negative values) and also finite-time stable. For this purpose, by considering a quadratic cost function, an optimal controller is designed such that in addition to minimizing the cost function, the positivity proper...

Sampling Rate Conversion in the Discrete Linear Canonical Transform Domain

Sampling rate conversion (SRC) is one of important issues in modern sampling theory. It can be realized by up-sampling, filtering, and down-sampling operations, which need large complexity. Although some efficient algorithms have been presented to do the sampling rate conversion, they all need to compute the N-point original signal to obtain the up-sampling or the down-sampling signal in the tim...

Linear Time Euclidean Distance Transform Algorithms

Two linear time (and hence asymptotically optimal) algorithms for computing the Euclidean distance transform of a two-dimensional binary image are presented. The algorithms are based on the construction and regular sampling of the Voronoi diagram whose sites consist of the unit (feature) pixels in the image. The rst algorithm, which is of primarily theoretical interest, constructs the complete ...

Trim state representations for linear discrete time behaviors

Metaplectic Forms and Representations

where the image of A is in the center of G̃. If G and G̃ are topological groups, and if A is a discrete subgroup of the center of G̃, then we may think of G̃ as a cover of G, in the topological sense. So we will sometimes use the term covering group. Very often for us, A will be the group μn(F ) of n-th roots of unity, in a given field F . We will use this notation only if |μn(F )| = n. By a Metapl...